Chemical-disease Relations Extraction Based on The Shortest Dependency Path Tree
نویسندگان
چکیده
Identifying chemical-disease relations (CDR) from biomedical literature could improve chemical safety and toxicity studies. This paper proposes a Shortest Dependency Path Tree (SDPT) to capture the most direct syntactic and semantic relationship between chemical and disease. Based on SDPT, structured dependency features (SDF), structured phrase features (SPF) and flattened dependency features (FDF) are proposed to represent syntactic information between two entities, which are all effective for CDR. Experiments on the CDR training and developing dataset show that our method achieves 55.05% F1-score.
منابع مشابه
A Shortest Path Dependency Kernel for Relation Extraction
We present a novel approach to relation extraction, based on the observation that the information required to assert a relationship between two named entities in the same sentence is typically captured by the shortest path between the two entities in the dependency graph. Experiments on extracting top-level relations from the ACE (Automated Content Extraction) newspaper corpus show that the new...
متن کاملN-ary Biographical Relation Extraction using Shortest Path Dependencies
Modern question answering and summarizing systems have motivated the need for complex n-ary relation extraction systems where the number of related entities (n) can be more than two. Shortest path dependency kernels have been proven to be effective in extracting binary relations. In this work, we propose a method that employs shortest path dependency based rules to extract complex n-ary relatio...
متن کاملDependency-directed Tree Kernel-based Protein-Protein Interaction Extraction from Biomedical Literature
There is a surge of research interest in protein-protein interaction (PPI) extraction from biomedical literature. While most of the state-of-the-art PPI extraction systems focus on dependency-based structured information, the rich structured information inherent in constituent parse trees has not been extensively explored for PPI extraction. In this paper, we propose a novel approach to tree ke...
متن کاملStudy of Kernel-Based Methods for Chinese Relation Extraction
In this paper, we mainly explore the effectiveness of two kernelbased methods, the convolution tree kernel and the shortest path dependency kernel, for Chinese relation extraction based on ACE 2007 corpus. For the convolution kernel, the performances of different parse tree spans involved in it for relation extraction are studied. Then, experiments with composite kernels, which are a combinatio...
متن کاملChinese Semantic Role Labeling with Dependency-Driven Constituent Parse Tree Structure
This paper explores a tree kernel-based method for nominal semantic role labeling (SRL). In particular, a new dependency-driven constituent parse tree (D-CPT) structure is proposed to better represent the dependency relations in a CPT-style structure, which employs dependency relation types instead of phrase labels in CPT. In this way, D-CPT not only keeps the dependency relationship informatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015